A Stochastic Local Search Algorithm for Distance-Based Phylogeny Reconstruction
نویسندگان
چکیده
منابع مشابه
A stochastic local search algorithm for distance-based phylogeny reconstruction.
In many interesting cases, the reconstruction of a correct phylogeny is blurred by high mutation rates and/or horizontal transfer events. As a consequence, a divergence arises between the true evolutionary distances and the differences between pairs of taxa as inferred from available data, making the phylogenetic reconstruction a challenging problem. Mathematically, this divergence translates i...
متن کاملPhase Transition in Distance-Based Phylogeny Reconstruction
We introduce a new distance-based phylogeny reconstruction technique which provably achieves, at sufficiently short branch lengths, a logarithmic sequence-length requirement—improving significantly over previous polynomial bounds for distance-based methods and matching existing results for general methods. The technique is based on an averaging procedure that implicitly reconstructs ancestral s...
متن کاملA novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملA distance-based parameter free algorithm for curve reconstruction
In this paper, a simple, efficient, and parameter free algorithm, DISCUR, is proposed to reconstruct curves from unorganized sample points. The proposed algorithm can reconstruct multiple simple curves that may be open, closed, and/or with sharp corners. The criteria for the curve reconstruction are based on two observations we have made concerning the human visual system: (1) two closest neigh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular Biology and Evolution
سال: 2010
ISSN: 0737-4038,1537-1719
DOI: 10.1093/molbev/msq154